منابع مشابه
Dynamic Shortest Paths Containers
Using a set of geometric containers to speed up shortest path queries in a weighted graph has been proven a useful tool for dealing with large sparse graphs. Given a layout of a graph G = (V, E), we store, for each edge (u, v) ∈ E, the bounding box of all nodes t ∈ V for which a shortest u-t-path starts with (u, v). Shortest path queries can then be answered by Dijkstra’s algorithm restricted t...
متن کاملShortest paths on dynamic graphs
Among the variants of the well known shortest path problem, those that refer to a dynamically changing graphs are theoretically interesting, as well as computationally challenging. Applicationwise, there is an industrial need for computing point-to-point shortest paths on large-scale road networks whose arcs are weighted with a travelling time which depends on traffic conditions. We survey rece...
متن کاملShortest paths between shortest paths
We study the following problem on recon guring shortest paths in graphs: Given two shortest st paths, what is the minimum number of steps required to transform one into the other, where each intermediate path must also be a shortest s-t path and must di er from the previous one by only one vertex. We prove that the shortest recon guration sequence can be exponential in the size of the graph and...
متن کاملMaintaining Shortest Paths in Dynamic Graphs
The first set of problems relies on the notion of Time-Dependent Networks. The considered model is a directed graph which temporal characteristics are fully known before processing the graph. Several interesting results have already been proved. For instance, Kaufmann and Smith have shown that finding the minimum time walk in FIFO networks is polynomial [2]. But, if the FIFO constraint is not s...
متن کاملDynamic Shortest Paths using JavaScript on GPUs
Information on the internet is growing rapidly and its processing needs high-speed infrastructure, both in hardware and software. JavaScript is now an integral ingredient of web applications which perform tasks ranging from error checking in online forms to processing Google maps. Due to their interactive nature, performance of JavaScript applications is critical, especially while handling huge...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2004
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2003.12.023